Some results on pseudosquares
نویسندگان
چکیده
If p is an odd prime, the pseudosquare Lp is defined to be the least positive nonsquare integer such that Lp ≡ 1 (mod 8) and the Legendre symbol (Lp/q) = 1 for all odd primes q ≤ p. In this paper we first discuss the connection between pseudosquares and primality testing. We then describe a new numerical sieving device which was used to extend the table of known pseudosquares up to L271. We also present several numerical results concerning the growth rate of the pseudosquares, results which so far confirm that Lp > e √ , an inequality that must hold under the extended Riemann Hypothesis.
منابع مشابه
Doubly-Focused Enumeration of Pseudosquares and Pseudocubes (DRAFT)
This paper offers numerical evidence for a conjecture that primality proving may be done in (logN) operations by examining the growth rate of quantities known as pseudosquares and pseudocubes. In the process, a novel method of solving simultaneous congruences— doubly-focused enumeration— is examined. This technique, first described by D. J. Bernstein, allowed us to obtain record-setting sieve c...
متن کاملThe Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/(π(p)(logn)); here π(x) is the prime counting function. Our algorithm requires only O(π(p)n) arithmetic operations and O(π(p) log n) space. It uses the pseudosquares primality test of Lukes, Patterson, and Williams. Under the assumption of the Extended Ri...
متن کاملOn pseudosquares and pseudopowers
Introduced by Kraitchik and Lehmer, an x-pseudosquare is a positive integer n ≡ 1 (mod 8) that is a quadratic residue for each odd prime p ≤ x, yet is not a square. We give a subexponential upper bound for the least x-pseudosquare that improves on a bound that is exponential in x due to Schinzel. We also obtain an equi-distribution result for pseudosquares. An x-pseudopower to base g is a posit...
متن کاملPseudopowers and primality proving
The so-called pseudosquares can be employed in very powerful machinery for the primality testing of integers N . In fact, assuming reasonable heuristics (which have been confirmed for numbers to 2) they can be used to provide a deterministic primality test in time O(log N), which some believe to be best possible. In the 1980s D.H. Lehmer posed a question tantamount to whether this could be exte...
متن کاملSome results on Noetherian semigroup
In this paper we study some results on Noetherian semigroups. We show that if $S_S$ is an strongly faithful $S$-act and $S$ is a duo weakly Noetherian, then we have the following.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 1996